Identification of 2D Interconnected Systems: An efficient Steepest-Descent approach.
نویسندگان
چکیده
منابع مشابه
Efficient perceptron learning using constrained steepest descent
An algorithm is proposed for training the single-layered perceptron. The algorithm follows successive steepest descent directions with respect to the perceptron cost function, taking care not to increase the number of misclassified patterns. The problem of finding these directions is stated as a quadratic programming task, to which a fast and effective solution is proposed. The resulting algori...
متن کاملSteepest Descent
The steepest descent method has a rich history and is one of the simplest and best known methods for minimizing a function. While the method is not commonly used in practice due to its slow convergence rate, understanding the convergence properties of this method can lead to a better understanding of many of the more sophisticated optimization methods. Here, we give a short introduction and dis...
متن کاملApproximate Steepest Coordinate Descent
We propose a new selection rule for the coordinate selection in coordinate descent methods for huge-scale optimization. The efficiency of this novel scheme is provably better than the efficiency of uniformly random selection, and can reach the efficiency of steepest coordinate descent (SCD), enabling an acceleration of a factor of up to n, the number of coordinates. In many practical applicatio...
متن کاملSoliton approach to the noisy Burgers equation Steepest descent method
The noisy Burgers equation in one spatial dimension is analyzed by means of the Martin-SiggiaRose technique in functional form. In a canonical formulation the morphology and scaling behavior are accessed by mean of a principle of least action in the asymptotic non-perturbative weak noise limit. The ensuing coupled saddle point field equations for the local slope and noise fields, replacing the ...
متن کاملSteepest descent on factor graphs
x f(x, θ) log f(x, θ) exists for all θ and θ. In principle, one can apply the sum-product algorithm in order to find (1), which involves the following two steps [2]: 1. Determine f(θ) by sum-product message passing. 2. Maximization step: compute θmax △ = argmaxθ f(θ). This procedure is often not feasible, since • When the variable x is continuous, the sum-product rule may lead to intractable in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2018
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2018.09.094